Papers with knowledge graph embeddings
Relation Embedding with Dihedral Group in Knowledge Graph (P19-1)
Copied to clipboard
| Challenge: | Existing models for link prediction fail to capture relation compositions, resulting in lack of interpretability for reasoning on incomplete knowledge graph (KG). |
| Approach: | They propose a new model that learns knowledge graph embeddings that can capture relation compositions by nature and reduces the solution space drastically. |
| Outcome: | The proposed model outperforms existing models and is comparable to or better than deep learning models such as ConvE. |
Adversarial Contrastive Estimation (P18-1)
Copied to clipboard
| Challenge: | Noise contrastive estimation (NCE) is a general strategy used in word embeddings and translations for knowledge graphs. |
| Approach: | They propose to augment negative sampler into mixture distribution with adversarially learned sampler and to combine it with noise contrastive estimation (NCE) they observe faster convergence and improved results on multiple metrics. |
| Outcome: | The proposed model performs better on word embeddings, order embedds and knowledge graph embeddments and faster convergence and improved results on multiple metrics. |
Counterfactual Reasoning with Knowledge Graph Embeddings (2024.eacl-long)
Copied to clipboard
| Challenge: | Knowledge graph embeddings were originally developed to infer true but missing facts in incomplete knowledge repositories. |
| Approach: | They propose a task that requires models to reason on a counterfactual KG. |
| Outcome: | The proposed task connects knowledge graph completion and counterfactual reasoning. |
Logical Neural Networks for Knowledge Base Completion with Embeddings & Rules (2022.emnlp-main)
Copied to clipboard
Prithviraj Sen, Breno William Carvalho, Ibrahim Abdelaziz, Pavan Kapanipathi, Salim Roukos, Alexander Gray
| Challenge: | Knowledge base completion (KBC) is a human-interpretable dialect . rule-based KBC has a high quality but low accuracy . |
| Approach: | They propose to use logical neural networks to learn both kinds of rules in a common framework using gradient-based optimization. |
| Outcome: | The proposed method improves by 10% relative to SotA rule-based methods and by combining it with knowledge graph embeddings it achieves an additional 7.5% relative improvement. |
Logic-guided Semantic Representation Learning for Zero-Shot Relation Classification (2020.coling-main)
Copied to clipboard
| Challenge: | Existing methods to zero-shot relation classification can only identify seen relations . existing methods rely on descriptive information to improve understandability of relation types . |
| Approach: | They propose a logic-guided semantic representation learning model for zero-shot relation classification that builds connections between seen and unseen relations via implicit and explicit semantic representations with knowledge graph embeddings and logic rules. |
| Outcome: | The proposed model can generalize to unseen relation types and achieve promising improvements. |
KnowLA: Enhancing Parameter-efficient Finetuning with Knowledgeable Adaptation (2024.naacl-long)
Copied to clipboard
| Challenge: | Existing methods for parameter-efficient finetuning (PEFT) are limited and only finetune a small number of parameters using limited instruction data. |
| Approach: | They propose a method that inserts an adaptation layer into an LLM to integrate embeddings of entities appearing in the input text. |
| Outcome: | The proposed method can activate parameterized knowledge in an LLM without changing its parameters or input prompts. |
Knowledge Graph Embeddings using Neural Ito Process: From Multiple Walks to Stochastic Trajectories (2023.findings-acl)
Copied to clipboard
Mojtaba Nayyeri, Bo Xiong, Majid Mohammadi, Mst. Mahfuja Akter, Mirza Mohtashim Alam, Jens Lehmann, Steffen Staab
| Challenge: | Existing knowledge graph embeddings have problems expressing knowledge graphs because they model a specific relation r from a head h to tails by transitioning deterministically to exactly one other point in the embeddable space. |
| Approach: | They propose a framework that models relations between nodes by relation-specific, stochastic transitions. |
| Outcome: | The proposed framework is expressive and generic subsuming state-of-the-art models operating on low-dimensional manifolds. |